Sharp thresholds and percolation in the plane
نویسندگان
چکیده
Recently, it was shown in [4] that the critical probability for random Voronoi percolation in the plane is 1/2. As a by-product of the method, a short proof of the Harris-Kesten Theorem was given in [5]. The aim of this paper is to show that the techniques used in these papers can be applied to many other planar percolation models, both to obtain short proofs of known results, and to prove new ones.
منابع مشابه
Line Percolation in Finite Projective Planes
We study combinatorial parameters of a recently introduced bootstrap percolation problem in finite projective planes. We present sharp results on the size of the minimum percolating sets and the maximal non-percolating sets. Additional results on the minimal and maximal percolation time as well as on the critical probability in the projective plane are also presented.
متن کاملAperiodic Non-Isomorphic Lattices with Equivalent Percolation and Random-Cluster Models
We explicitly construct an uncountable class of infinite aperiodic plane graphs which have equal, and explicitly computable, bond percolation thresholds. Furthermore for both bond percolation and the random-cluster model all large scale properties, such as the values of the percolation threshold and the critical exponents, of the graphs are equal. This equivalence holds for all values of p and ...
متن کاملBootstrap percolation with individual thresholds
Bootstrap percolation is a random process that models the spread of activation on a linked structure. Starting with an initial set of active vertices, in each round all inactive vertices with at least r active neighbors become and remain active until there are no inactive vertices with enough active neighbors left. Due to its numerous applications in modeling of physical processes, bootstrap pe...
متن کاملHabitat fragmentation and biodiversity collapse in neutral communities
Models of habitat fragmentation have mainly explored the effects on a few-species ecologies or on a hierarchical community of competitors. These models reveal that, under different conditions, ecosystem response can involve sharp changes when some given thresholds are reached. However, perturbations, recruitment limitation and other causes may prevent competitive hierarchies from actually opera...
متن کاملThe time of bootstrap percolation with dense initial sets for all thresholds
In r-neighbor bootstrap percolation on the vertex set of a graph G, vertices are initially infected independently with some probability p. At each time step, the infected set expands by infecting all uninfected vertices that have at least r infected neighbors. We study the distribution of the time at which all vertices become infected. Given d ≥ r ≥ 2 and t = t(n) = o ( (log n/ log logn)1/(d−r+...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 29 شماره
صفحات -
تاریخ انتشار 2006